On the Distributional Complexity of Disjointness
نویسنده
چکیده
385 EIsevier Note Îï the distributional complexity of disjointness Abstract Razborov, À.À., Îï the distributional complexity of disjointness, Theoretical Computer ScienCe 106 (1992) 385-390. We prove that the distributional communication complexity of the predicate "disjointness" with respect to à very simple measure îï inputs is Ùï).
منابع مشابه
Razborov Disjointness Lower Bound , Forster ’ S Theorem
In this lecture, we show two results dealing with lower bounds in communication complexity. The first lower bound is an Ω(n) lower bound on the distributional complexity of Disjointness due to [3, 8]. Here we will present the simplified proof presented in [8]. In the second part, we will show how to obtain lower bounds on the unbounded error probabilistic communication complexity by Forster’s m...
متن کاملTrading Information Complexity for Error
We consider the standard two-party communication model. The central problem studied in this article is how much one can save in information complexity by allowing an error of ε. • For arbitrary functions, we obtain lower bounds and upper bounds indicating a gain that is of order Ω(h(ε)) and O(h( √ ε)). Here h denotes the binary entropy function. • We analyze the case of the two-bit AND function...
متن کاملCorrelation in Hard Distributions in Communication Complexity
We study the effect that the amount of correlation in a bipartite distribution has on the communication complexity of a problem under that distribution. We introduce a new family of complexity measures that interpolates between the two previously studied extreme cases: the (standard) randomised communication complexity and the case of distributional complexity under product distributions. We gi...
متن کاملSimplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Ω(n/4). This gives the first lower bound that is linear in n, nearly matching Grolmusz’s upper bound of O(log(n) + kn/2). We also simplify Sherstov’s proof showing an Ω( √ n/(k2)) lower bound for the randomized communication complexity of set disjointness.
متن کاملCommunication Complexity Theory: Thirty-Five Years of Set Disjointness
The set disjointness problem features k communicating parties and k subsets S1, S2, . . . , Sk ⊆ {1, 2, . . . , n}. No single party knows all k subsets, and the objective is to determine with minimal communication whether the k subsets have nonempty intersection. The important special case k = 2 corresponds to two parties trying to determine whether their respective sets intersect. The study of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 106 شماره
صفحات -
تاریخ انتشار 1992